ON OPTIMALITY CONDITIONS FOR TRILEVEL DYNAMIC OPTIMIZATION PROBLEMS

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global Optimality Conditions for Optimization Problems∗

We establish new necessary and sufficient optimality conditions for optimization problems. In particular, we establish tractable optimality conditions for the problems of minimizing a weakly convex or concave function subject to standard constraints, such as box constraints, binary constraints, and simplex constraints. Our main theoretical tool for establishing these optimality conditions is ab...

متن کامل

On -optimality Conditions for Convex Set-valued Optimization Problems

In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...

متن کامل

On Optimality Conditions for Abstract Convex Vector Optimization Problems

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and 2-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we p...

متن کامل

Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures

‎We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces‎. ‎Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems‎. ‎Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of informatics and cybernetics

سال: 1999

ISSN: 0286-522X

DOI: 10.5109/13485